One-to-one disjoint path covers on multi-dimensional tori
نویسندگان
چکیده
One-to-one disjoint path covers on multi-dimensional tori Jing Li, Di Liu, Yuxing Yang & Jun Yuan a School of Applied Science, Taiyuan University of Science and Technology, Taiyuan 030024, China b School of Mathematical Sciences, Shanxi University, Taiyuan 030006, China c College of Mathematics and Information Science, Henan Normal University, XinXiang 453007, China Accepted author version posted online: 10 Jul 2014.Published online: 08 Aug 2014.
منابع مشابه
Many-to-Many Disjoint Path Covers in Two-Dimensional Bipartite Tori with a Single Vertex Fault
A paired many-to-many -disjoint path cover (-DPC for short) of a graph is a set of disjoint paths joining distinct source-sink pairs in which each vertex of the graph is covered by a path. A two-dimensional × torus is a graph defined as the product of two cycles and of length and , respectively. In this paper, we deal with an × bipartite torus, even ≥ , with a single faul...
متن کاملPaired Many-to-Many Disjoint Path Covers in Recursive Circulants and Tori
A paired many-to-many -disjoint path cover (paired -DPC) of a graph is a set of disjoint paths joining distinct source-sink pairs in which each vertex of is covered by a path. In this paper, we investigate disjoint path covers in recursive circulants with ≥ and tori, and show that provided the number of faulty elements (vertices and/or edges) is or less, every nonbiparti...
متن کاملEdge-disjoint spanners in tori
A spanning subgraph S = (V , E ) of a connected graph G = (V , E) is an (x + c)-spanner if for any pair of vertices u and v, dS(u, v) ≤ dG(u, v) + c where dG and dS are the usual distance functions in G and S, respectively. The parameter c is called the delay of the spanner. We study edge-disjoint spanners in graphs in multi-dimensional tori. We show that each two-dimensional torus has a set of...
متن کاملReliability assessment of power distribution systems using disjoint path-set algorithm
Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...
متن کاملOne-to-Many Disjoint Path Covers in a Graph with Faulty Elements
In a graph G, k disjoint paths joining a single source and k distinct sinks that cover all the vertices in the graph are called a one-tomany k-disjoint path cover of G. We consider a k-disjoint path cover in a graph with faulty vertices and/or edges obtained by merging two graphs H0 and H1, |V (H0)| = |V (H1)| = n, with n pairwise nonadjacent edges joining vertices in H0 and vertices in H1. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Comput. Math.
دوره 92 شماره
صفحات -
تاریخ انتشار 2015